Unification of Leapfrog and Crank--Nicolson Finite Difference Time Domain Methods
نویسندگان
چکیده
منابع مشابه
A Crank-Nicolson Leapfrog stabilization: Unconditional stability and two applications
We propose and analyze a linear stabilization of the Crank-Nicolson Leap-Frog (CNLF) method that removes all timestep / CFL conditions for stability and controls the unstable mode. It also increases the SPD part of the linear system to be solved at each time step. We give a proof of unconditional stability of the method as well as a proof of unconditional, asymptotic stability of both the stabl...
متن کاملCrank-nicolson Finite Difference Method for Solving Time-fractional Diffusion Equation
In this paper, we develop the Crank-Nicolson finite difference method (C-N-FDM) to solve the linear time-fractional diffusion equation, formulated with Caputo’s fractional derivative. Special attention is given to study the stability of the proposed method which is introduced by means of a recently proposed procedure akin to the standard Von-Neumann stable analysis. Some numerical examples are ...
متن کاملA Closed-Form Solution for Two-Dimensional Diffusion Equation Using Crank-Nicolson Finite Difference Method
In this paper a finite difference method for solving 2-dimensional diffusion equation is presented. The method employs Crank-Nicolson scheme to improve finite difference formulation and its convergence and stability. The obtained solution will be a recursive formula in each step of which a system of linear equations should be solved. Given the specific form of obtained matrices, rather than sol...
متن کاملAdaptive Crank-nicolson Methods for Parabolic Problems
In this paper we present a posteriori error estimators for the approximate solutions of linear parabolic equations. We consider discretizations of the problem by discontinuous Galerkin method in time corresponding to variant Crank-Nicolson schemes and continuous Galerkin method in space. Especially, £nite element spaces are permitted to change at different time levels. Exploiting Crank-Nicolson...
متن کاملConvergence analysis of Crank–Nicolson and Rannacher time-marching
This paper presents a convergence analysis of Crank–Nicolson and Rannacher time-marching methods which are often used in finite difference discretizations of the Black–Scholes equations. Particular attention is paid to the important role of Rannacher’s startup procedure, in which one or more initial timesteps use backward Euler timestepping, to achieve second-order convergence for approximation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 2018
ISSN: 1064-8275,1095-7197
DOI: 10.1137/16m1079634